Clustering of Paths in Complex Networks

Table 1: Overview of the used data set. For each configuration, the size of the associated problem space is shown (|V c| and |Ec| denote the number of nodes and edges of the problem space, |V c used | denote the number of nodes which occur in at least one of the paths, % is the the percentage of used nodes), min |p| denotes the length of the optimal solution path. The remaining columns contain the information of how many paths are contained in the data set for each configuration and how many of them are solving and non-solving.